Correction to "Coordination of groups of mobile autonomous agents using nearest neighbor rules"

نویسندگان

  • Ali Jadbabaie
  • Jie Lin
  • A. Stephen Morse
چکیده

A. Jadbabaie was with Yale University, New Haven, CT 06520 USA. He is now with the Department of Electrical and Systems Engineering and GRASP Laboratory, University of Pennsylvania, Philadelphia, PA 19104 USA (e-mail: [email protected]). J. Lin and A. S. Morse are with the Center for Computational Vision and Control, Department of Electrical Engineering, Yale University, New Haven, CT 06520 USA. Digital Object Identifier 10.1109/TAC.2003.817537 Jie Lin was born in Shangrao, P. R. China, in 1976. He received the undergraduate degree in physics from Fundan University, Shangai, P. R. China, the M.S. degree in physics from Creighton University, Omaha, NE, and the M.S. degree in electrical engineering from Yale University, New Haven, CT, in 1997, 1999, and 2002, respectively. He is currently working toward the Ph.D. degree at Yale University. His research interests are in the areas of analysis and synthesis of multiagent coordination control, as well as the application to mobile sensor networks and robotics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comments on "Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules"

We clarify the relation between the model and the convergence results of Jadbabaie et al. to those of Bertsekas et al. We show that the update equations in Jadbabaie et al. are a special case of those in Bertsekas et al. Furthermore, the main convergence results in Sections II and III of Jadbabaie et al. are essentially the same as those derived earlier in Bertsekas et al.

متن کامل

Coordination of groups of mobile autonomous agents using nearest neighbor rules

In a recent Physical Review Letters article, Vicsek et. al. propose a simple but compelling discrete-time model of n autonomous agents {i.e., points or particles} all moving in the plane with the same speed but with different headings. Each agent’s heading is updated using a local rule based on the average of its own heading plus the headings of its “neighbors.” In their paper, Vicsek et. al. p...

متن کامل

Multi-agent coordination using nearest neighbor rules: revisiting the Vicsek model

Recently, Jadbabaie, Lin, and Morse (2003) offered a mathematical analysis of the discrete time model of groups of mobile autonomous agents raised by Vicsek et al. in 1995. In their paper, Jadbabaie et al. showed that all agents shall move in the same heading, provided that these agents are periodically linked together. This paper sharpens this result by showing that coordination will be reache...

متن کامل

ul 2 00 4 Multi - agent coordination using nearest neighbor rules : a revisit to Vicsek model ∗

Recently Jadbabaie, Lin and Morse (IEEE Transactions on Automatic Control, 48(6):988-1001, 2003.) give a mathematical analysis for the discrete time model of groups of mobile autonomous agents raised by Vicsek et al. in 1995. In their paper, Jadbabaie et al. show that all agents shall move in the same heading provided that these agents are periodically linked together. This paper sharpens this ...

متن کامل

Comment on "Coordination of Groups of mobile autonomous agents using nearest neighbor Rules"

We clarify the relation of the model and the convergence results of Jadbabaie et al. [3] to those studied by Bertsekas et al. [6, 5, 1]. We show that the update equations in [3] are a very special case of those in [5]. Furthermore, the main convergence results in [3] are special cases of those in [5], except for a small difference in the connectivity assumptions which, however, does not affect ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Automat. Contr.

دوره 48  شماره 

صفحات  -

تاریخ انتشار 2003